Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
91	Structural properties underlying high-quality Randomized Numerical Linear Algebra algorithms Michael W. Mahoney ∗ Add to Reading List Source URL: www.stat.berkeley.edu Language: English - Date: 2016-03-03 02:50:08 Numerical linear algebra Matrix Principal component analysis Orthogonal matrix Gaussian elimination Singular value decomposition Low-rank approximation MoorePenrose pseudoinverse QR decomposition QR algorithm Matrix completion Linear least squares
92	A DOMINATION ALGORITHM FOR {0, 1}-INSTANCES OF THE TRAVELLING SALESMAN PROBLEM DANIELA KÜHN, DERYK OSTHUS AND VIRESH PATEL Abstract. We present an approximation algorithm for {0, 1}-instances of the travelling salesman Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2015-05-23 01:02:41
93	Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2013-03-20 23:48:10 NP-complete problems Clique problem Approximation algorithm Probability distributions Dominating set
94	The Expectation-Maximization Algorithm Gautham Nair 1 An approximation to the log likelihood in the Add to Reading List Source URL: rajlab.seas.upenn.edu Language: English - Date: 2016-04-07 22:18:54
95	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2008-02-01 14:51:28 Computational complexity theory Theory of computation Complexity classes NP-complete problems Mathematical optimization NP-hard problems MAX-3SAT NP Approximation algorithm Probabilistically checkable proof PCP theorem APX
96	11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-11-08 06:52:04 Scheduling Operations research NP-complete problems Complexity classes Combinatorial optimization Makespan Knapsack problem NP Algorithm Vertex cover Approximation algorithm Job shop scheduling
97	Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2015-12-01 10:37:13 Matching Combinatorics NP-complete problems Combinatorial optimization Spanning tree Stable marriage problem Approximation algorithm 3-dimensional matching Minimum spanning tree
98	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: www.siam.org Language: English - Date: 2013-09-19 09:13:08
99	RIGOROUS UNIFORM APPROXIMATION OF D-FINITE FUNCTIONS USING CHEBYSHEV EXPANSIONS ALEXANDRE BENOIT, MIOARA JOLDES, AND MARC MEZZAROBBA Abstract. A wide range of numerical methods exists for computing polynomial approximati Add to Reading List Source URL: www.marc.mezzarobba.net Language: English - Date: 2014-07-11 07:39:27 Algebra Orthogonal polynomials Elementary algebra Numerical analysis Approximation theory Chebyshev polynomials Polynomial Recurrence relation Holonomic function Minimax approximation algorithm Rational function Factorization
100	OPTIMALLY LEARNING SOCIAL NETWORKS WITH ACTIVATIONS AND SUPPRESSIONS ALT Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2010-09-09 14:03:18 Artificial neural networks Dana Angluin Artificial neuron Approximation algorithm

UPDATE